Shape Dimension and Approximation from Samples
نویسندگان
چکیده
منابع مشابه
Shape Dimension and Intrinsic Metric from Samples of Manifolds
We introduce the adaptive neighborhood graph as a data structure for modeling a smooth manifold M embedded in some Euclidean space . We assume that M is known to us only through a finite sample P ⊂ M , as it is often the case in applications. The adaptive neighborhood graph is a geometric graph on P . Its complexity is at most min{2O(k)n, n2}, where n = |P | and k = dim M , as opposed to the n ...
متن کاملEstimating dimension From small samples
Dclails of a ncw algorirh~n lo cstimatc thc dirnc~~sion of a mcasurc tioru point s a m p l a arc clescribcd, T!ic ncw algorill~rn emphasizes rhal di~ncnsion ncctl no( be Il~e sarnc at dl scnlcs, 1l1a1 is, t l ~c r c ncctl not bc a "scaling rcgion. '~Ilc i\\gorilhm is ucriLcd with Gaussian o~c,~surcs and is found to bc rcliablc ancl hirvc Lcss domanding clnla rctl\~ircmcnts t h a n coavcn~ional ...
متن کاملfragmentability and approximation
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
15 صفحه اولHausdorff dimension and Diophantine approximation
In the present survey paper, we explain how the theory of Hausdorff dimension and Hausdorff measure is used to answer certain questions in Diophantine approximation. The final section is devoted to a discussion around the Diophantine properties of the points lying in the middle third Cantor set.
متن کاملShape from shading using linear approximation
In this paper, we present an extremely simple algorithm for shape from shading, which can be implemented in 25 lines of C code 1. The algorithm is very fast, taking .2 seconds on a Sun SparcStation-1 for a 128 128 image, and is purely local and highly parallelizable (parallel implementation included). In our approach, we employ a linear approximation of the reeectance function, as used by other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2003
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-002-2838-9